Impacts of increasing maximum truck weight – case Finland
نویسندگان
چکیده
منابع مشابه
Maximum Dispersion and Geometric Maximum Weight Cliques1
We consider a facility location problem, where the objective is to “disperse” a number of facilities, i.e., select a given number k of locations from a discrete set of n candidates, such that the average distance between selected locations is maximized. In particular, we present algorithmic results for the case where vertices are represented by points in d-dimensional space, and edge weights co...
متن کاملMaximum-weight-basis preconditioners
This paper analyzes a novel method for constructing preconditioners for diagonally-dominant symmetric positivedefinite matrices. The method discussed here is based on a simple idea: we construct M by simply dropping offdiagonal nonzeros from A and modifying the diagonal elements to maintain a certain row-sum property. The preconditioners are extensions of Vaidya’s augmented maximum-spanning-tre...
متن کاملMaximum Weight Spectrum Codes
In the recent work [7], a combinatorial problem concerning linear codes over a finite field Fq was introduced. In that work the authors studied the weight set of an [n, k]q linear code, that is the set of non-zero distinct Hamming weights, showing that its cardinality is upper bounded by q −1 q−1 . They showed that this bound was sharp in the case q = 2, and in the case k = 2. They conjectured ...
متن کاملApproximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this subgraph closely approximates the maximum weight branching in the original graph. Specifically, it is within a factor of k k+1 . Our interest in finding branchings in this subgraph is motivated by a data compression appl...
متن کاملIrreducible Polynomials of Maximum Weight
We establish some necessary conditions for the existence of irreducible polynomials of degree n and weight n over F2. Such polynomials can be used to efficiently implement multiplication in F2n . We also provide a simple proof of a result of Bluher concerning the reducibility of a certain family of polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Transport Research Review
سال: 2020
ISSN: 1867-0717,1866-8887
DOI: 10.1186/s12544-020-00403-z